63A - Sinking Ship - CodeForces Solution

/* 
    author : Antar chandra Nath
    
*/
 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long int lli;
#define fast        ios::sync_with_stdio(0);cin.tie(0);cin.tie(0);
#define endl        "\n"
#define pb          push_back
#define po          pop_back
#define sz(x)       x.size()
#define all(x)      x.begin(), x.end()
#define fi          first 
#define se          second 
#define cn          cin >> 
#define co          cout <<
#define rep(i,n)    for(int i=0;i<n;i++)
#define per(i,n)    for(int i=n-1;i>=0;i--)
#define loop(i,j,n) for(int i=j;i<=n;i++)
#define vi          vector<int>
#define vvi         vector<vector<int>>
#define yes         cout << "YES" << endl
#define no          cout << "NO" << endl
#define mci         map<char, int> 
#define mii         map<int, int>
#define pi          pair<int, int>
#define pll         pair<ll, ll>
 
int dx[] = {-1, 1, 0, 0, -1, -1, 1, 1};
int dy[] = {0, 0, -1, 1, -1, 1, -1, 1};
const int maxn = 1e5 + 1;
const int mm = 1e9 + 9;
const ll mmm = 1e18 + 18;
ll gcd(ll a, ll b) {return __gcd(a, b);}
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b);}
  
void solve(){
    int n;
    cin >> n;
    vector<string> a(n), b(n);
    vector<string> v = {"rat", "woman", "man", "captain"};
    map<string, vector<string> > mp;
    rep(i, n){
        cin >> a[i] >> b[i];
        if(b[i] == "woman" or b[i] == "child")
            mp["woman"].pb(a[i]);
        else
            mp[b[i]].pb(a[i]);
    }

    rep(i, 4){
        rep(j, mp[v[i]].size()){
            cout << mp[v[i]][j] << endl;
        }
    }
    
    

    return;
}
 
int main(){
    fast;
    int t(1);
    // cn t;
    while(t--){
        solve();
    }
    return 0;
}